Generalized budgeted submodular set function maximization

In the generalized budgeted submodular set function maximization problem, we are given a ground of elements and bins. Each bin has its own cost each element depends on associated bin. The goal is to find subset along with an bins such that overall costs both at most budget, profit maximized. We present algorithm guarantees 12(1?1e?)-approximation, where ??1 approximation factor for sub-problem. If satisfy specific condition, provide polynomial-time gives us ?=1??, while general case design ?=1?1e??. extend our results providing bi-criterion can spend extra budget up ??1 guarantee 12(1?1e??)-approximation.